-
1 рекурсивно сходящаяся последовательность
Русско-английский научно-технический словарь Масловского > рекурсивно сходящаяся последовательность
-
2 рекурсивно сходящаяся последовательность
Mathematics: recursively convergent sequenceУниверсальный русско-английский словарь > рекурсивно сходящаяся последовательность
См. также в других словарях:
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Continued fraction — Finite continued fraction, where a0 is an integer, any other ai are positive integers, and n is a non negative integer. In mathematics, a continued fraction is an expression obtained through an iterative process of representing a number as the… … Wikipedia
Factorial — n n! 0 1 1 1 2 2 3 6 4 24 5 120 6 720 7 … Wikipedia
Computability — You might be looking for Computable function, Computability theory, Computation, or Theory of computation. Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within… … Wikipedia
Riemann zeta function — ζ(s) in the complex plane. The color of a point s encodes the value of ζ(s): dark colors denote values close to zero and hue encodes the value s argument. The white spot at s = 1 is the pole of the zeta function; the black spots on the… … Wikipedia
Solving quadratic equations with continued fractions — In mathematics, a quadratic equation is a polynomial equation of the second degree. The general form is:ax^2+bx+c=0,,!where a ne; 0.Students and teachers all over the world are familiar with the quadratic formula that can be derived by completing … Wikipedia
Computability theory (computer science) — In computer science, computability theory is the branch of the theory of computation that studies which problems are computationally solvable using different models of computation.Computability theory differs from the related discipline of… … Wikipedia
Laguerre polynomials — In mathematics, the Laguerre polynomials, named after Edmond Laguerre (1834 ndash; 1886), are the canonical solutions of Laguerre s equation::x,y + (1 x),y + n,y = 0,which is a second order linear differential equation.This equation has… … Wikipedia
Numerical ordinary differential equations — Illustration of numerical integration for the differential equation y = y,y(0) = 1. Blue: the Euler method, green: the midpoint method, red: the exact solution, y = et. The step size is h = 1.0 … Wikipedia
Reverse mathematics — is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. The method can briefly be described as going backwards from the theorems to the axioms. This contrasts with the ordinary… … Wikipedia
Formal power series — In mathematics, formal power series are devices that make it possible to employ much of the analytical machinery of power series in settings that do not have natural notions of convergence. They are also useful, especially in combinatorics, for… … Wikipedia